高斯型空间光孤子相互作用的数值研究

 通过数值模拟的方法，对高斯孤子在对数型饱和非线性介质中的相互作用进行了研究，考查了两光束间的相对振幅和相对相位对其相互作用的影响。结果表明：高斯孤子之间的相互作用敏感地依赖于两光束间的相对振幅和相对相位。在不同的振幅差异范围内，光束间的主要作用交替地表现为相互排斥和相互吸引，并由于高斯孤子的不稳定性，导致了光束在碰撞后以一种尺寸周期性变化的呼吸模式传输。随着相对相位的增大，两光束间始终持续地表现出强烈的排斥作用，直到相对相位增加到一个2π周期之后。而且碰撞之后，光束也都以呼吸模式进行传输，其分离的角度越大，呼吸就越明显。     

飞秒孤子传输演化的数值研究

利用分步傅里叶法数值模拟了飞秒孤子在光纤中的传输演化过程。对光纤中单个孤子的传输及二阶孤子的自陡峭效应和自频移效应进行了分析,指出在一定的参数取值范围内,自频移效应对二阶fs孤子传输的影响要比自陡峭效应大,占主导地位,且对自陡峭效应有一定的抑制作用。     

级联三能级介质中非线性光学信号的增强

揭示非最大相干可能比最大相干产生更有效的非线性频率转换. 为此以三能级级联系统(没有最大相干)为例计算其非线性光学信号的强度, 并与三能级Λ型系统(具有最大相干)进行比较. 利用非微扰方法计算表明, 在双光子共振和相同参数的条件下, 级联系统产生的非线性光学信号的最大强度约是Λ系统的两倍. 利用缀饰态表象分析表明, 两个系统中耦合跃迁的自发辐射及其介入的不可逆三光子过程具有相反的作用. 它们在级联系统中加强非线性转换, 而在Λ系统中削弱非线性转换. 关键词： 电磁感应透明 非线性光学过程 双光子共振     

Modelling recruitment training in mathematical human resource planning

This paper deals with mathematical human resource planning; more specifically, it suggests a new model for a manpower‐planning system. In general, we study a k‐classed hierarchical system where the workforce demand at each time period is satisfied through internal mobility and recruitment. The motivation for this work is based on various European Union incentives, which promote regional or local government assistance programs that could be exploited by firms not only for hiring and training newcomers, but also to improve the skills and knowledge of their existing personnel. In this respect, in our augmented mobility model we establish a new ‘training/standby’ class, which serves as a manpower inventory position for potential recruits. This class, which may very well be internal or external to the system, is incorporated into the framework of a non‐homogeneous Markov chain model. Furthermore, cost objectives are employed using the goal‐programming approach, under different operating assumptions, in order to minimize the operational cost in the presence of system's constraints and regulations. Copyright © 2002 John Wiley & Sons, Ltd.     

Global and uniform convergence of subspace correction methods for some convex optimization problems

This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained convex optimization problems. Some multigrid and domain decomposition methods are also discussed as special examples for solving some nonlinear elliptic boundary value problems.

     

Toward Fuzzy Optimization without Mathematical Ambiguity

Fuzzy programming has been discussed widely in literature and applied in such various disciplines as operations research, economic management, business administration, and engineering. The main purpose of this paper is to present a brief review on fuzzy programming models, and classify them into three broad classes: expected value model, chance-constrained programming and dependent-chance programming. In order to solve general fuzzy programming models, a hybrid intelligent algorithm is also documented. Finally, some related topics are discussed.     

烷氧基取代聚对苯乙炔三阶非线性光学性能

通过双醚化反应、氯甲基化反应以及在强碱性条件下进行的脱氯化氢反应制备聚（2-甲氧基-5-丁氧基）对苯乙炔（PMOBOPV）、聚（2-甲氧基-5-己氧基）对苯乙炔（PMOHOPV）、聚（2,5-二丁氧基）对苯乙炔（PDBOPV）和聚（2,5-二己氧基）对苯乙炔（PDHOPV）等四种可溶性聚对苯乙炔（PPV）衍生物，通过紫外-可见吸收光谱对产物分子结构进行表征.结果显示，PMOBOPV、PMOHOPV、PDBOPV和PDHOPV的共轭π电子发生π → π* 跃迁的吸收峰分别位于491 nm、495nm、504nm和510nm处，相应的光学禁带宽度分别为2.23eV、2.18eV、2.12eV和2.07eV.利用简并四波混频技术测量PPV衍生物的三阶非线性光学性能，探讨了分子结构对PPV衍生物三阶非线性极化率（χ(3)）的影响.研究发现，激发波长为532 nm时，PMOBOPV、PMOHOPV、PDBOPV和PDHOPV的共振χ(3)值分别为3.45×10－10、5.13×10－10、7.15×10－10和9.61×10－10 esu；激发波长为1064 nm时，它们的非共振χ(3)值分别为1.09×10－11、1.42×10－11、1.62×10－11和2.14×10－11 esu.     

Reductions of interval nonlinear programming problem

A general nonlinear programming problem with interval functions is considered. Two reductions of this problem to the deterministic nonlinear programming problem are proposed, and illustrative examples are discussed.     

Darboux Transformation for Tzitzeica Equation

We present a Darboux transformation for Tzitzeica equation associated with 3 × 3 matrix spectral problem. The explicit solution of Tzitzeica equation is obtained.     

Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problems

In this paper we obtain Lower Bounds (LBs) to concave cost network flow problems. The LBs are derived from state space relaxations of a dynamic programming formulation, which involve the use of non-injective mapping functions guaranteing a reduction on the cardinality of the state space. The general state space relaxation procedure is extended to address problems involving transitions that go across several stages, as is the case of network flow problems. Applications for these LBs include: estimation of the quality of heuristic solutions; local search methods that use information of the LB solution structure to find initial solutions to restart the search (Fontes et al., 2003, Networks, 41, 221–228); and branch-and-bound (BB) methods having as a bounding procedure a modified version of the LB algorithm developed here, (see Fontes et al., 2005a). These LBs are iteratively improved by penalizing, in a Lagrangian fashion, customers not exactly satisfied or by performing state space modifications. Both the penalties and the state space are updated by using the subgradient method. Additional constraints are developed to improve further the LBs by reducing the searchable space. The computational results provided show that very good bounds can be obtained for concave cost network flow problems, particularly for fixed-charge problems.